Static Multiprocessor Task Graph Scheduling inthe Genetic Paradigm : A Comparison ofGenotype Representations 2
نویسندگان
چکیده
Ecole Normale Sup erieure de Lyon Unit e de recherche associ ee au CNRS no 1398 SPI Static Multiprocessor Task Graph Scheduling in the Genetic Paradigm: A Comparison of Genotype Representations 2 P. Rebreyend F. E. Sandnes1 G.M. Megson1 F. E. Sandnes is supported by a studentship provided by The Research Council of Norway 1 Parallel, Emergent and Distributed Architecture Laboratory (PEDAL) Department of Computer Science, The University of Reading Reading, RG6 2AY, United Kingdom 2This work was partially supported by the HCM project SCOOP Solving Combinatorial Optimisation Problems in Parallel of the European Union. May 1998 Research Report No 98-25
منابع مشابه
Static Multiprocessor Task Graph Scheduling in the Genetic Paradigm A Comparison of Genotype Representations
In the NP hard multiprocessor scheduling problem a set of precedence con strained tasks are allocated onto processors in a processing order in order to minimise the makespan Many heuristic methods for nding solutions exist but they are all sub optimal on general task graphs To improve these solu tions genetic algorithms have successfully been applied to the problem and the results reported have...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملMultiprocessor Environment Using Genetic Algorithm
Task Scheduling [1] is the allocation of resources over time to perform a collection of tasks. Real -time systems make use of scheduling algorithms to maximize the number of real -time tasks that can be processed without violating timing constraints. A scheduling algorithm provides a schedule for a task set that assigns tasks to processors and provides an ordered list of tasks. The schedule is ...
متن کاملScheduling of a flexible flow shop with multiprocessor task by a hybrid approach based on genetic and imperialist competitive algorithms
This paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. The objective is to minimize the weighted sum of makespan and maximum tardiness. Three meta-heuristic methods based on genetic algorithm (GA), imperialist competitive algorithm (ICA) and a hybrid approach of GA a...
متن کامل